A forest building process on simple graphs
نویسندگان
چکیده
Consider the following process for a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning forest of the graph. The probability of obtaining k components in this process for complete bipartite graphs is determined as well as a formula for the expected number of components in any graph. A generic recurrence and some additional basic properties are discussed.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملInduced Forests in Regular Graphs with Large Girth
An induced forest of a graph G is an acyclic induced subgraph of G. The present paper is devoted to the analysis of a simple randomised algorithm that grows an induced forest in a regular graph. The expected size of the forest it outputs provides a lower bound on the maximum number of vertices in an induced forest of G. When the girth is large and the degree is at least 4, our bound coincides w...
متن کاملBuilding Forests in Maker-Breaker Games: Upper and Lower Bounds
We give explicit "linear-time" strategies for building spanning forests in 1 : 1 Maker-Breaker games and matching lower bounds in some interesting cases, e.g. for a forest of k-cycles. Here a forest refers to a disjoint union of factors that span the graph. Furthermore, for the purposes of these upper bounds these forests can be arbitrary finite mixtures of different factor graphs.
متن کاملNegative Correlation in Graphs and Matroids
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniformly random forest F and the uniformly random connected subgraph C of a finite graph G have the edge-negative-association property. In other words, for all distinct edges e and f of G, the probability that F (respectively, C) contains e conditioned on containing f is less than or equal to the probabi...
متن کاملOn linear arboricity of cubic graphs
A linear forest is a graph in which each connected component is a chordless path. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. When each path has length at most k a linear forest is a linear k-forest and lak(G) will denote the minimum number of linear k-forests partitioning E(G). We cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 341 شماره
صفحات -
تاریخ انتشار 2018